$p$-cyclic persistent homology and Hofer distance
نویسندگان
چکیده
منابع مشابه
P-persistent homology of finite topological spaces
Let P be a finite partially ordered set, briefly a finite poset. We will show that for any P -persistent object X in the category of finite topological spaces, there is a P− weighted graph, whose clique complex has the same P -persistent homology as X.
متن کاملCyclic homology and equivariant homology
The purpose of this paper is to explore the relationship between the cyclic homology and cohomology theories of Connes [9-11], see also Loday and Quillen [20], and "IF equivariant homology and cohomology theories. Here II" is the circle group. The most general results involve the definitions of the cyclic homology of cyclic chain complexes and the notions of cyclic and cocyclic spaces so precis...
متن کاملThe Coherent Matching Distance in 2D Persistent Homology
Comparison between multidimensional persistent Betti numbers is often based on the multidimensional matching distance. While this metric is rather simple to define and compute by considering a suitable family of filtering functions associated with lines having a positive slope, it has two main drawbacks. First, it forgets the natural link between the homological properties of filtrations associ...
متن کاملOn the cyclic Homology of multiplier Hopf algebras
In this paper, we will study the theory of cyclic homology for regular multiplier Hopf algebras. We associate a cyclic module to a triple $(mathcal{R},mathcal{H},mathcal{X})$ consisting of a regular multiplier Hopf algebra $mathcal{H}$, a left $mathcal{H}$-comodule algebra $mathcal{R}$, and a unital left $mathcal{H}$-module $mathcal{X}$ which is also a unital algebra. First, we construct a para...
متن کاملPersistent Homology and Nested Dissection
Nested dissection exploits the underlying topology to do matrix reductions while persistent homology exploits matrix reductions to the reveal underlying topology. It seems natural that one should be able to combine these techniques to beat the currently best bound of matrix multiplication time for computing persistent homology. However, nested dissection works by fixing a reduction order, where...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symplectic Geometry
سال: 2019
ISSN: 1527-5256,1540-2347
DOI: 10.4310/jsg.2019.v17.n3.a7